- computer modelling of argumentation
- Лингвистика: компьютерное моделирование аргументации
Универсальный англо-русский словарь. Академик.ру. 2011.
computer modelling of argumentation
Смотреть что такое "computer modelling of argumentation" в других словарях:
Discovery Net — is one of the earliest examples of a scientific workflow system allowing users to coordinate the execution of remote services based on Web service and Grid Services (OGSA and Open Grid Services Architecture) standards. The system was designed and … Wikipedia
Scientific method — … Wikipedia
Wicked problem — The concept of wicked problems was originally proposed by Horst Rittel (a pioneering theorist of design and planning, and late professor at the University of California, Berkeley) and M. Webber ref|1 in a seminal treatise for social planning,… … Wikipedia
Otto Neurath — Otto Karl Wilhelm Neurath Full name Otto Karl Wilhelm Neurath Born December 10, 1882(1882 12 10) Vienna, Austro Hungarian Empire (now in Austria) Died December 22, 1945(1945 12 22) (aged 63) Oxford, UK … Wikipedia
Ontology language — In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. They allow the encoding of knowledge about specific domains and often include reasoning rules that support the processing of… … Wikipedia
Conceptual model — For other uses, see Model (disambiguation). In the most general sense, a model is anything used in any way to represent anything else. Some models are physical objects, for instance, a toy model which may be assembled, and may even be made to… … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
Structure (mathematical logic) — In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations which are defined on it. Universal algebra studies structures that generalize the algebraic structures such as… … Wikipedia
Complete theory — In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is… … Wikipedia
Compendium (software) — Compendium Screenshot of v.1.5.2 Developer(s) Compendium Institute Written in Java … Wikipedia
